Conjugacy in Houghton's groups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conjugacy in Thompson’s groups

We give a unified solution the conjugacy problem in Thompson’s groups F , V , and T using strand diagrams, a modification of tree diagrams. We then analyze the complexity of the resulting algorithms. Thompson’s group F is the group of all piecewise-linear homeomorphisms of the unit interval satisfying the following conditions: 1. Every slope is a power of two, and 2. Every breakpoint has dyadic...

متن کامل

Conjugacy in Reductive Groups

Let G be a reductive algebraic group and H be a connected semisimple subgroup of G. The dimension data consists of the collection { dimV H } with V H denoting the space of points in V fixed by H , and where (ρ, V ) runs through all representations of G. One may ask if the dimension data determine H up to conjugacy or at least isomorphism. In other words, If H and H ′ have the same dimension dat...

متن کامل

Conjugacy Languages in Groups

We study the regularity of several languages derived from conjugacy classes in a finitely generated group G for a variety of examples including word hyperbolic, virtually abelian, Artin, and Garside groups. We also determine the rationality of the growth series of the shortlex conjugacy language in virtually cyclic groups, proving one direction of a conjecture of Rivin. 2010 Mathematics Subject...

متن کامل

Conjugacy in Houghton’s Groups

Let n ∈ N. Houghton’s group Hn is the group of permutations of {1, . . . , n} × N, that eventually act as a translation in each copy of N. We prove the solvability of the conjugacy problem and conjugator search problem for Hn, n ≥ 2. 2010 Mathematics Subject Classification: Primary: 20F10, 20B99.

متن کامل

Twisted Conjugacy in Braid Groups

In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm which, given two braids u, v ∈ Bn and an automorphism φ ∈ Aut(Bn), decides whether v = (φ(x))−1ux for some x ∈ Bn. As a corollary, we deduce that each group of the form Bn o H, a semidirect product of the braid group Bn by a torsion-free hyperbolic group H, has solvable conjugacy problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publicacions Matemàtiques

سال: 2015

ISSN: 0214-1493

DOI: 10.5565/publmat_59115_01